Math. Log. Quart, 1 – 4 Mathematical Logic Quarterly c WILEY-VCH Verlag Berlin GmbH 2001

Source URL: www.mathematik.tu-darmstadt.de

• Dialectica interpretation
• Intuitionism
• Proof theory
• Sheaf
• Product rule
• Portable character set

Information Theory based Validation for Point-cloud Segmentation aided by Tensor Voting Ming Liu, Roland Siegwart Autonomous Systems Lab, ETH Zurich, Switzerland ,

Source URL: www.ee.ust.hk

• Statistics
• Computational statistics
• Data mining
• Data analysis
• Cluster analysis
• Geostatistics
• Image segmentation
• K-means clustering
• Spectral clustering
• Determining the number of clusters in a data set
• Consensus clustering

journalof Journal of Statistical Planning and InferenceELSEVIER

Source URL: www.ntu.edu.sg

• Fourier analysis
• Multiplier
• Difference set
• Divisor
• Sheaf theory
• Binary operations
• Sheaf of modules
• Convolution

CS269: Machine Learning Theory Problem Set 1 Due Wednesday, October 27, 2010 Ground Rules: • This problem set is due at the beginning of class on October 27. Please bring a hard copy of your solutions with you to class

Source URL: www.jennwv.com

Mathematical Logic Quarterly, 23 OctoberThe Natural Numbers in Constructive Set Theory Michael Rathjen1, ∗ 1

Source URL: www1.maths.leeds.ac.uk

A note on Bar Induction in Constructive Set Theory∗ Michael Rathjen Department of Mathematics The Ohio State University Columbus, OH 43210, USA and

Source URL: www1.maths.leeds.ac.uk

Proof Theory: From arithmetic to set theory Michael Rathjen July 2, 2014 1

Source URL: www1.maths.leeds.ac.uk

Lifschitz Realizability for Intuitionistic Zermelo-Fraenkel Set Theory RAY-MING CHEN, School of Mathematics, University of Leeds Leeds LS2 9JT, UK, E-mail: MICHAEL RATHJEN, School of Mathematics, Un

Source URL: www1.maths.leeds.ac.uk

Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ † Research Center for Information Technology Innova

Source URL: nms.citi.sinica.edu.tw

• Mathematics
• Graph theory
• Computational complexity theory
• Combinatorial optimization
• Submodular set function
• Edsger W. Dijkstra
• NP-complete problems
• Algorithm
• Shortest path problem
• HeldKarp algorithm
• Dominating set

OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set

Source URL: ludovicpatey.com

• Computability theory
• Mathematical logic
• Proof theory
• Theory of computation
• Logic in computer science
• Computable function
• Reverse mathematics
• PA degree
• Peano axioms